import java.util.*;

class Solution {


    /**
     * 最小公倍数
     *
     * @param a
     * @param b
     * @return 公约数
     */
    static int gac(int a, int b) {
        if (a % b == 0) return b;

        return gac(b, a % b);
    }

    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();


        int c = gac(a, b);
        System.out.println(a * b / c);

    }

    /**
     * @param arr
     * @return
     */

//    public static int MLS (int[] arr) {
//
//        if(arr.length == 1) return 1;
//        //1.排序
//        Arrays.sort(arr);
//
//        int len = 1;
//        for(int left = 0,right = 1; right < arr.length;right++){
//            //1.进入窗口
//
//            //2.判断
//            if(arr[right] != arr[right - 1] + 1) {
//                int r = right - left;
//                for (int i = 0; i < r; i++) left++;
//            }
//
//            //更新
//            if(right - left + 1 > len) len = right - left + 1;
//        }
//        return len;
//    }
//
//    public static void main1(String[] args) {
//       int len = Solution.MLS(new int[]{1,2,341,21,22,3,4,5,1,7,6,2,9,10,8});
//    }
    public static int MLS(int[] arr) {

        Arrays.sort(arr);

        int len = arr.length, count = 1, ret = 1;

        for (int left = 0, right = 1; right < len; right++) {

            //1.进入窗口
            if (arr[right] - 1 == arr[right - 1]) {
                count++;
                ret = Math.max(ret, count);
            } else if (arr[right] == arr[right - 1]) {
                ;
            } else {
                left = right;
                count = 1;
            }
        }
        return ret;
    }

    public static void main2(String[] args) {
        int len = Solution.MLS(new int[]{7, 8, 2, 6, 1, 1, 7, 2, 4, 3, 4, 7, 5, 6, 8, 2});
    }


    /**
     * 求路线获取的最大值
     * https://www.nowcoder.com/practice/9740ce2df0a04399a5ade1927d34c1e1?tpId=230&tqId=38954&ru=/exam/oj
     *
     * @param args
     */
    public static void main3(String[] args) {
        Scanner in = new Scanner(System.in);

        int n = in.nextInt(), m = in.nextInt();

        int[][] dps1 = new int[n + 1][m + 1];
        char[][] dps = new char[n + 1][m + 1];


        for (int i = 1; i <= n; i++) {
            char[] s = in.next().toCharArray();

            for (int j = 1; j <= m; j++) {
                dps[i][j] = s[j - 1];

                int r = 0;
                if (dps[i][j] == 'l') r = 4;
                else if (dps[i][j] == 'o') r = 3;
                else if (dps[i][j] == 'v') r = 2;
                else if (dps[i][j] == 'e') r = 1;

                dps1[i][j] = Math.max(dps1[i - 1][j] + r, dps1[i][j - 1] + r);
            }
        }

        System.out.println(dps1[n][m]);

    }
}